Spectral Radius and Traceability of Connected Claw-Free Graphs
نویسندگان
چکیده
Let G be a connected claw-free graph on n vertices and G be its complement. Let μ(G) be the spectral radius of G. Denote by Nn−3,3 the graph consisting of Kn−3 and three disjoint pendent edges. In this note we prove that: (1) If μ(G) ≥ n − 4, then G is traceable unless G = Nn−3,3. (2) If μ(G) ≤ μ(Nn−3,3) and n ≥ 24, then G is traceable unless G = Nn−3,3. Our works are counterparts on claw-free graphs of previous theorems due to Lu et al., and Fiedler and Nikiforov, respectively.
منابع مشابه
Traceability in Small Claw-Free Graphs
We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices and a minimal number of edges. This complements a result of Matthews on Hamiltonian graphs.
متن کاملOn traceability and 2-factors in claw-free graphs
If G is a claw-free graph of sufficiently large order n, satisfying a degree condition σk > n+k2−4k+7 (where k is an arbitrary constant), then G has a 2-factor with at most k − 1 components. As a second main result, we present classes of graphs C1, . . . , C8 such that every sufficiently large connected claw-free graph satisfying degree condition σ6(k) > n + 19 (or, as a corollary, δ(G) > n+19 ...
متن کاملClosure and stable Hamiltonian properties in claw-free graphs
In the class of k-connected claw-free graphs, we study the stability of some hamilto-nian properties under a closure operation introduced by the third author. We prove that (i) the properties of pancyclicity, vertex pancyclicity and cycle extendability are not stable for any k (i.e., for any of these properties there is an innnite family of graphs G k of arbitrarily high connectivity k such tha...
متن کاملClosure and Hamiltonian-connectivity of claw-free graphs
In [3], the closure cl(G) for a claw-free graph G is de ned, and it is proved that G is hamiltonian if and only if cl(G) is hamiltonian. On the other hand, there exist in nitely many claw-free graphs G such that G is not hamiltonian-connected (resp. homogeneously traceable) while cl(G) is hamiltonian-connected (resp. homogeneously traceable). In this paper we de ne a new closure clk(G) (k 1) as...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کامل